Expressive Probability Models in Science

نویسنده

  • Stuart J. Russell
چکیده

The paper is a brief summary of an invited talk given at the Discovery Science conference. The principal points are as follows: rst, that probability theory forms the basis for connecting hypotheses and data; second, that the expressive power of the probability models used in scientiic theory formation has expanded signiicantly; and nally, that still further expansion is required to tackle many problems of interest. This further expansion should combine probability theory with the expressive power of rst-order logical languages. The paper sketches an approximate inference method for representation systems of this kind. Classical philosophers of science have proposed a \deductive-nomological" approach in which observations are the logical consequence of hypotheses that explain them. In practice, of course, observations are subject to noise. In the simplest case, one attributes the noise to random perturbations within the measuring process. For example, the standard least-squares procedure for tting linear models to data eeectively assumes constant-variance Gaussian noise applied to each datum independently. In more complex situations, uncertainty enters the hypotheses themselves. In Mendelian genetics, for instance, characters are inherited through a random process; experimental data quantify, but do not eliminate, the uncertainty in the process. Probability theory provides the mathematical basis relating data to hypotheses when uncertainty is present. Given a set of data D, a set of possible hypotheses H, and a question X, the predicted answer according to the full Bayesian approach is P (XjD) = X H2H P (XjH)P(DjH)P(H) where is a normalizing constant, P (XjH) is the prediction of each hypothesis H, P (DjH) is the likelihood of the data given the hypothesis H and therefore incorporates the measurement process, and P (H) is the prior probability of H. Because H may be large, it is not always possible to calculate exact Bayesian predictions. Recently, Markov chain Monte Carlo (MCMC) methods have shown great promise for approximate Bayesian calculations 3], and will be discussed further below. In other cases, a single maximum a posteriori (MAP) hypothesis can be selected by maximizing P (DjH)P(H).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying ω-Regular Properties of Markov Chains

In this work we focus on model checking of probabilistic models. Probabilistic models are widely used to describe randomized protocols. A Markov chain induces a probability measure on sets of computations. The notion of correctness now becomes probabilistic. We solve here the general problem of lineartime probabilistic model checking with respect to ω-regular specifications. As specification fo...

متن کامل

FORMAL EPISTEMOLOGY: Representing the fixation of belief and its undoing

Formal epistemology is a discipline with various branches and sub-branches dealing with precise representations of attitudes and their flux. The formal tools utilized for this purpose go from standard probability theory to non-standard (or infinitesimal) probability, to decision theoretical tools to logical tools. These lectures are divided in two parts. The first part deals with static represe...

متن کامل

Of Starships and Klingons: Bayesian Logic for the 23rd Century

Intelligent systems in an open world must reason about many interacting entities related to each other in diverse ways and having uncertain features and relationships. Traditional probabilistic languages lack the expressive power to handle relational domains. Classical first-order logic is sufficiently expressive, but lacks a coherent plausible reasoning capability. Recent years have seen the e...

متن کامل

On the Connections between Relational and XML Probabilistic Data Models

A number of uncertain data models have been proposed, based on the notion of compact representations of probability distributions over possible worlds. In probabilistic relational models, tuples are annotated with probabilities or formulae over Boolean random variables. In probabilistic XML models, XML trees are augmented with nodes that specify probability distributions over their children. Bo...

متن کامل

Approximating the Expressive Power of Logics in Finite Models

We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order formula) which, on the one hand, captures uniform circuit classes such as AC and TC over arithmetic models, namely, finite structures with linear order and arithmetic relations, and, on the other hand, their semantics, with respec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999